Optimization problem

Results: 1483



#Item
341NP-complete problems / Functional languages / Procedural programming languages / Recursion / Clique problem / Mathematical optimization / Clique / Independent set / Dynamical system / Theoretical computer science / Mathematics / Applied mathematics

Discrete Applied Mathematics–49 Annealed replication: a new heuristic for the maximum clique problem Immanuel M. Bomzea; ∗ , Marco Budinichb , Marcello Pelilloc , Claudio Rossic

Add to Reading List

Source URL: www.dais.unive.it

Language: English - Date: 2002-12-03 08:21:13
342Combinatorial optimization / NP-complete problems / Matching / Cut / Shortest path problem / Time complexity / Maximum cut / Travelling salesman problem / Hungarian algorithm / Theoretical computer science / Graph theory / Mathematics

PDF Document

Add to Reading List

Source URL: web.eecs.umich.edu

Language: English - Date: 2014-02-11 03:59:44
343Greedy algorithm / Matroid theory / Mathematical optimization / Algorithm / Approximation algorithm / Function / Optimization problem / Golden ratio base / Activity selection problem / Mathematics / Applied mathematics / Operations research

Algorithms, Spring 2014, CSE, OSU Greedy algorithms II Instructor: Anastasios Sidiropoulos Greedy algorithms

Add to Reading List

Source URL: web.cse.ohio-state.edu

Language: English - Date: 2014-01-26 21:00:59
344Game theory / Combinatorial optimization / Stable marriage problem / Bread bun / Hand / Egyptian hieroglyphs / Matching / Cooperative games

Discussion Paper NoAN IMPOSSIBILITY THEOREM IN MATCHING PROBLEMS Shohei Takagi

Add to Reading List

Source URL: www.iser.osaka-u.ac.jp

Language: English - Date: 2006-12-11 21:08:50
345NP-complete problems / Complexity classes / Approximation algorithms / Spanning tree / Travelling salesman problem / Polynomial-time approximation scheme / Time complexity / Optimization problem / Algorithm / Theoretical computer science / Computational complexity theory / Applied mathematics

Mathematical Programming manuscript No. (will be inserted by the editor) Sanjeev Arora ?

Add to Reading List

Source URL: www.cs.duke.edu

Language: English - Date: 2007-02-04 13:37:22
346Regression analysis / Stochastic optimization / Operations research / Digital signal processing / Filter theory / Stochastic gradient descent / ADALINE / Mathematical optimization / Least mean squares filter / Numerical analysis / Statistics / Mathematics

Constrained Stochastic Gradient Descent for Large-scale Least Squares Problem Yang Mu University of Massachusetts Boston 100 Morrissey Boulevard

Add to Reading List

Source URL: www.cs.umb.edu

Language: English - Date: 2013-06-25 22:09:13
347Noise reduction / Sound recording / Interferometric synthetic aperture radar / Maximum flow problem / Sine / Mathematical optimization / Total variation / Logarithm / Mathematics / Image processing / Audio engineering

PHASE IMAGING: UNWRAPPING AND DENOISING WITH DIVERSITY AND MULTI-RESOLUTION Gonc¸alo Valad˜ao and Jos´e Bioucas-Dias Instituto de Telecomunicac¸o˜ es and Instituto Superior T´ecnico, Av. Rovisco Pais, Torre Norte,

Add to Reading List

Source URL: ticsp.cs.tut.fi

Language: English - Date: 2008-09-03 05:20:54
348Game theory / Stable marriage problem / Matching theory / Tax / Labour economics / Mathematics / Matching / Combinatorial optimization

Taxation in Matching Markets∗ Sonia Jaffe‡ (Job Market Paper) Scott Duke Kominers§

Add to Reading List

Source URL: www.scottkom.com

Language: English - Date: 2014-10-26 20:33:46
349Combinatorial optimization / Minimum spanning tree / Spanning tree / Job shop scheduling / Maximum flow problem / Max-flow min-cut theorem / Cut / Connectivity / David Shmoys / Graph theory / Mathematics / Theoretical computer science

CME 305: Discrete Mathematics and Algorithms Instructor: Professor Amin Saberi () Midterm – Problem 1. Show that a graph has a unique minimum spanning tree if, for every cut of the graph, th

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:43:36
350Graph connectivity / Combinatorial optimization / Connectivity / Shortest path problem / Cut / Bridge / Maximum flow problem / Eulerian path / Graph theory / Mathematics / Theoretical computer science

Improved Approximation for the Directed Spanner Problem∗ Piotr Bermana , Arnab Bhattacharyyab,1 , Konstantin Makarychevc , Sofya Raskhodnikovaa,2 , Grigory Yaroslavtseva,2 a

Add to Reading List

Source URL: konstantin.makarychev.net

Language: English - Date: 2014-06-08 22:16:08
UPDATE